Citation for published version Bowman , Howard and Wyble , Brad and Barnard , Philip ( 2004 )

نویسنده

  • B. P. WYBLE
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using ǫ-greedy reinforcement learning methods to further understand ventromedial prefrontal patients’ deficits on the Iowa Gambling Task

If you believe this document infringes copyright then please contact the KAR admin team with the take-down information provided at http://kar.kent.ac.uk/contact.html Citation for published version Kalidindi, Kiran and Bowman, Howard and Wyble, Brad (2005) Using e-greedy reinforcement learning methods to further understand ventromedial prefrontal patients' deficits on the Iowa Gambling Task. Tec...

متن کامل

An Investigation of the Myopia for Future Consequences Theory of Vmf Patient Behaviour on the Iowa Gambling Task; an Abstract Neural Network Simulation

If you believe this document infringes copyright then please contact the KAR admin team with the take-down information provided at http://kar.kent.ac.uk/contact.html Citation for published version Kalidindi, Kiran and Bowman, Howard and Wyble, Brad (2005) An investigation of the myopia for future consequences theory of VMF patient behaviour on the Iowa Gambling Task: An abstract neural network ...

متن کامل

A reciprocal relationship between bottom-up trace strength and the attentional blink bottleneck: Relating the LC–NE and ST models

If you believe this document infringes copyright then please contact the KAR admin team with the take-down information provided at http://kar.kent.ac.uk/contact.html Citation for published version Bowman, Howard and Wyble, Brad and Chennu, Srivas and Craston, Patrick (2008) A Reciprocal Relationship Between Bottom-up Trace Strength and the Attentional Blink Bottleneck: Relating the LC-NE and ST...

متن کامل

Citation for published version Su , Li and Bowman , Howard and Wyble , Brad ( 2006 ) Formal Modeling of Connectionism using

This paper illustrates a framework for applying formal methods techniques, which are symbolic in nature, to specifying and verifying neural networks, which are subsymbolic in nature. The paper describes a communicating automata [Bowman & Gomez, 2006] model of neural networks. We also implement the model using timed automata [Alur & Dill, 1994] and then undertake a verification of these models u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006